The dining cryptographers problem: Unconditional sender and recipient untraceability

The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability

appeared in: Proceedings of EUROCRYPT'89, LNCS, Springer-Verlag Heidelberg The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability Michael Waidner, Birgit Pfitzmann Universität Karlsruhe, Postfach 6980 D-7500 Karlsruhe 1, F. R. Germany

Unconditional Sender and Recipient Untraceability in Spite of Active Attacks

A protocol is described which allows to send and receive messages anonymously using an arbitrary communication network, and it is proved to be unconditionally secure. This improves a result by DAVID CHAUM: The DC-net guarantees the same, but on the assumption of a reliable broadcast network. Since unconditionally secure Byzantine Agreement cannot be achieved, such a reliable broadcast network c...

Unconditional Sender and Recipient Untraceability in spite of Active Attacks – Some Remarks

Dining Cryptographers are Practical

The dining cryptographers protocol provides information-theoretically secure sender and recipient untraceability. However, the protocol is considered to be impractical because a malicious participant may disrupt the communication. We propose an implementation which provides information-theoretical security for senders and recipients, and in which a disruptor with limited computational capabilit...

Dining Cryptographers’ Wiki

This paper introduces an implementation of a closed group distributed anonymous wiki based on a Dining Cryptographer (DC) network. We argue that such a wiki application particularly suits the properties of a DC network, e.g., performance is less important, and broadcast communication is needed by default.